Introduction to automata theory, languages, and computation - (2. ed.)
نویسندگان
چکیده
This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
منابع مشابه
CS4232 – Theory of Computation
These lecture notes contain all material relevant for the examinations and the course. For further reading, the author refers to the textbooks Automata Theory and its Applications by Bakhadyr Khoussainov and Anil Nerode [46] and Introduction to Automata Theory, Languages, and Computation by Hopcroft, Motwani and Ullman [35]. The author would like to thank Volker Diekert, Henning Fernau, Vladimi...
متن کاملOn the Behavioral Equivalence Between k-data Structures
or specifications. Sci. Comput. Program., 25, 149–186. [7] Goguen, J. and Malcolm, G. (2000) A hidden agenda. Theor. Comput. Sci., 245, 55–101. [8] Blok, W. and Pigozzi, D. (1992) Algebraic semantics for universal Horn logic without equality. In Romanowska, A. and Smith, J.D.H. (eds.) Universal algebra and quasigroup theory, Lect. Conf., 1989. Res. Expo. Math. Vol. 19. pp. 1–56, Heldermann Verl...
متن کاملIntroduction to Automata Theory, Languages and Computation
Where you can find the introduction to automata theory languages and computation easily? Is it in the book store? On-line book store? are you sure? Keep in mind that you will find the book in this site. This book is very referred for you because it gives not only the experience but also lesson. The lessons are very valuable to serve for you, that's not about who are reading this introduction to...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملOne-stack Automata as Acceptors of Context-free Languages*
This paper presents one-stack automata as acceptors of context-free languages; these are equivalent to Pushdown Automata which are well known in automata theory. As equivalence relations such as equivalence of Turing Machines and two-stack Pushdown Automata help in learning general properties of formal modeling, the equivalence relation of Pushdown Automata and one-stack automata also helps in ...
متن کامل